On symmetric neighborhood assignments

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ranking Outliers Using Symmetric Neighborhood Relationship

Mining outliers in database is to find exceptional objects that deviate from the rest of the data set. Besides classical outlier analysis algorithms, recent studies have focused on mining local outliers, i.e., the outliers that have density distribution significantly different from their neighborhood. The estimation of density distribution at the location of an object has so far been based on t...

متن کامل

Investigations on autark assignments

The structure of the monoid of autarkies for clause-sets is investigated (autarkies are generalizations of satisfying (truth) assignments). The notion of a \plain clause-set" is introduced, where every clause is usable by some resolution refutation, and it is shown that a clause-set is plain ii it has no non-trivial autarky. Every clause-set has a unique decomposition into a plain sub-clause-se...

متن کامل

On Popular Random Assignments

One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there is no other assignment that is preferred by a majority of the agents. Popular assignments need not exist, but the minimax theorem implies the existence of a popular random assignment. In t...

متن کامل

On common neighborhood graphs II

Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.

متن کامل

On Computing Pareto Stable Assignments

Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different solution concepts with different objectives. One of the most important and well-studied ones is that of stability, proposed by Gale and Shapley [8], which captures fairness condition in a model where every individual i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2013

ISSN: 0166-8641

DOI: 10.1016/j.topol.2013.01.013